home *** CD-ROM | disk | FTP | other *** search
- Path: mail2news.demon.co.uk!genesis.demon.co.uk
- From: Lawrence Kirby <fred@genesis.demon.co.uk>
- Newsgroups: comp.lang.c
- Subject: Re: Fastest way to computer log(base2) of x?
- Date: Wed, 07 Feb 96 14:00:59 GMT
- Organization: none
- Message-ID: <823701659snz@genesis.demon.co.uk>
- References: <4e61iu$p6e@villa.fc.net> <4e72il$dvl@ns.RezoNet.NET> <4f647p$lc5@druid.borland.com>
- Reply-To: fred@genesis.demon.co.uk
- X-NNTP-Posting-Host: genesis.demon.co.uk
- X-Newsreader: Demon Internet Simple News v1.27
- X-Mail2News-Path: genesis.demon.co.uk
-
- In article <4f647p$lc5@druid.borland.com> pete@borland.com "Pete Becker" writes:
-
- ...
-
- >Still faster: use a table with INT_MAX entries and remove all of the
- >conditionals. Why do the responses here assume that sacrificing speed for
- >space savings is appropriate? The question asks for the fastest, not something
- >that's reasonably fast but doesn't use much space.
-
- While it may not have been an explicitly stated requirement I'd certainly
- favour a solution that was strictly conforming i.e. could be run on any
- standard C implementation.
-
- --
- -----------------------------------------
- Lawrence Kirby | fred@genesis.demon.co.uk
- Wilts, England | 70734.126@compuserve.com
- -----------------------------------------
-